Waterbodies和附近相关对象的基于视觉的语义分割提供了管理水资源和处理洪水紧急情况的重要信息。然而，缺乏用于水相关类别的大规模标记培训和测试数据集可防止研究人员在计算机视野中研究水有关的问题。为了解决这个问题，我们呈现亚特兰蒂斯，一个新的水平和相关对象的语义分割的新基准。亚特兰蒂斯由5,195张Waterbodies图像组成，以及56级物体的高质量像素级手动注释，其中包括17级人为物体，18级自然对象和21个一般课程。我们详细介绍了亚特兰蒂斯，并在我们的基准上评估了几种最先进的语义分段网络。此外，通过在两个不同的路径中加工水生和非水生植物来制定新的深度神经网络水平，用于水体语义分割。 Aquanet还包含低级功能调制和交叉路径调制，可增强特征表示。实验结果表明，拟议的Aquanet优于亚特兰蒂斯的其他最先进的语义细分网络。我们声称，亚特兰蒂斯是最大的水体图像数据集，用于语义分割，提供各种水和水有关的类，它将有利于计算机视觉和水资源工程的研究人员。

This paper deals with the problem of statistical and system heterogeneity in a cross-silo Federated Learning (FL) framework where there exist a limited number of Consumer Internet of Things (CIoT) devices in a smart building. We propose a novel Graph Signal Processing (GSP)-inspired aggregation rule based on graph filtering dubbed ``G-Fedfilt''. The proposed aggregator enables a structured flow of information based on the graph's topology. This behavior allows capturing the interconnection of CIoT devices and training domain-specific models. The embedded graph filter is equipped with a tunable parameter which enables a continuous trade-off between domain-agnostic and domain-specific FL. In the case of domain-agnostic, it forces G-Fedfilt to act similar to the conventional Federated Averaging (FedAvg) aggregation rule. The proposed G-Fedfilt also enables an intrinsic smooth clustering based on the graph connectivity without explicitly specified which further boosts the personalization of the models in the framework. In addition, the proposed scheme enjoys a communication-efficient time-scheduling to alleviate the system heterogeneity. This is accomplished by adaptively adjusting the amount of training data samples and sparsity of the models' gradients to reduce communication desynchronization and latency. Simulation results show that the proposed G-Fedfilt achieves up to $3.99\% $ better classification accuracy than the conventional FedAvg when concerning model personalization on the statistically heterogeneous local datasets, while it is capable of yielding up to $2.41\%$ higher accuracy than FedAvg in the case of testing the generalization of the models.

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

In this work, we propose a communication-efficient two-layer federated learning algorithm for distributed setups including a core server and multiple edge servers with clusters of devices. Assuming different learning tasks, clusters with a same task collaborate. To implement the algorithm over wireless links, we propose a scalable clustered over-the-air aggregation scheme for the uplink with a bandwidth-limited broadcast scheme for the downlink that requires only two single resource blocks for each algorithm iteration, independent of the number of edge servers and devices. This setup is faced with interference of devices in the uplink and interference of edge servers in the downlink that are to be modeled rigorously. We first develop a spatial model for the setup by modeling devices as a Poisson cluster process over the edge servers and quantify uplink and downlink error terms due to the interference. Accordingly, we present a comprehensive mathematical approach to derive the convergence bound for the proposed algorithm including any number of collaborating clusters in the setup and provide important special cases and design remarks. Finally, we show that despite the interference in the proposed uplink and downlink schemes, the proposed algorithm achieves high learning accuracy for a variety of parameters.

Social media platforms allow users to freely share their opinions about issues or anything they feel like. However, they also make it easier to spread hate and abusive content. The Fulani ethnic group has been the victim of this unfortunate phenomenon. This paper introduces the HERDPhobia - the first annotated hate speech dataset on Fulani herders in Nigeria - in three languages: English, Nigerian-Pidgin, and Hausa. We present a benchmark experiment using pre-trained languages models to classify the tweets as either hateful or non-hateful. Our experiment shows that the XML-T model provides better performance with 99.83% weighted F1. We released the dataset at https://github.com/hausanlp/HERDPhobia for further research.

Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.

基于各种非负矩阵分解（NMF）方法为成本函数添加了新术语，以使模型适应特定任务，例如聚类或保留减少空间中的某些结构属性（例如，局部不变性）。附加的术语主要由高参数加权，以控制整体公式的平衡，以指导优化过程实现目标。结果是一种参数化的NMF方法。但是，NMF方法采用了无监督的方法来估计分解矩阵。因此，不能保证使用新的特征执行预测（例如分类）的能力。这项工作的目的是设计一个进化框架，以学习参数化NMF的超参数，并以监督的方式估算分解矩阵，以更适合分类问题。此外，我们声称，将基于NMF的算法分别应用于不同的类对，而不是将其应用于整个数据集，从而提高了矩阵分解过程的有效性。这导致训练具有不同平衡参数值的多个参数化的NMF算法。采用了交叉验证组合学习框架，并使用遗传算法来识别最佳参数值集。我们对真实和合成数据集进行的实验证明了所提出的方法的有效性。

当前信息时代在互联网上产生的数据的指数增长是数字经济的推动力。信息提取是累积大数据中的主要价值。对统计分析和手工设计的规则机器学习算法的大数据依赖性被人类语言固有的巨大复杂性所淹没。自然语言处理（NLP）正在装备机器，以了解这些人类多样化和复杂的语言。文本分类是一个NLP任务，它会自动识别基于预定义或未定标记的集合的模式。常见的文本分类应用程序包括信息检索，建模新闻主题，主题提取，情感分析和垃圾邮件检测。在文本中，某些单词序列取决于上一个或下一个单词序列以使其充分含义。这是一项具有挑战性的依赖性任务，要求机器能够存储一些以前的重要信息以影响未来的含义。诸如RNN，GRU和LSTM之类的序列模型是具有长期依赖性任务的突破。因此，我们将这些模型应用于二进制和多类分类。产生的结果非常出色，大多数模型在80％和94％的范围内执行。但是，这个结果并不详尽，因为我们认为如果机器要与人类竞争，可以改进。

在自然界中，动物的集体行为（例如飞鸟）由同一物种的个体之间的相互作用主导。但是，对鸟类物种中这种行为的研究是一个复杂的过程，即人类无法使用常规的视觉观察技术（例如自然界的焦点采样）进行。对于鸟类等社会动物，群体形成的机制可以帮助生态学家了解社交线索及其视觉特征随着时间的流逝（例如姿势和形状）之间的关系。但是，恢复飞行鸟类的不同姿势和形状是一个极具挑战性的问题。解决此瓶颈的一种广泛的解决方案是将姿势和形状从2D图像提取到3D对应关系。 3D视觉的最新进展导致了关于3D形状和姿势估计的许多令人印象深刻的作品，每项作品都有不同的利弊。据我们所知，这项工作是首次尝试概述基于单眼视觉的3D鸟重建的最新进展，使计算机视觉和生物学研究人员概述了现有方法，并比较其特征。

最近的工作引入了该日期，作为深度学习中不确定性建模的一种新方法。Epatet是一个添加到传统神经网络中的小神经网络，它可以共同产生预测分布。尤其是，使用音调可以大大提高多个输入的联合预测的质量，这是神经网络了解其不知道的程度的衡量标准。在本文中，我们检查了在分配变化下是否可以提供类似的优势。我们发现，在ImageNet-A/O/C中，谐调通常可以改善稳健性指标。此外，这些改进比非常大的合奏所提供的改进更为重要，即计算成本较低的数量级。但是，与分配稳定深度学习的杰出问题相比，这些改进相对较小。播集可能是工具箱中的有用工具，但它们远非完整的解决方案。